Computing infeasibility certificates for combinatorial problems through Hilbert’s Nullstellensatz
نویسندگان
چکیده
منابع مشابه
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
Systems of polynomial equations with coefficients over a field K can be used to concisely model combinatorial problems. In this way, a combinatorial problem is feasible (e.g., a graph is 3colorable, hamiltonian, etc.) if and only if a related system of polynomial equations has a solution over the algebraic closure of the field K. In this paper, we investigate an algorithm aimed at proving combi...
متن کاملLow Degree Nullstellensatz Certificates for 3-Colorability
In a seminal paper, De Loera et. al introduce the algorithm NulLA (Nullstellensatz Linear Algebra) and use it to measure the difficulty of determining if a graph is not 3-colorable. The crux of this relies on a correspondence between 3-colorings of a graph and solutions to a certain system of polynomial equations over a field k. In this article, we give a new direct combinatorial characterizati...
متن کاملCombinatorial Nullstellensatz
We present a general algebraic technique and discuss some of its numerous applications in Combinatorial Number Theory, in Graph Theory and in Combinatorics. These applications include results in additive number theory and in the study of graph coloring problems. Many of these are known results, to which we present unified proofs, and some results are new.
متن کاملCombinatorial Nullstellensatz
The Combinatorial Nullstellensatz is a theorem about the roots of a polynomial. It is related to Hilbert’s Nullstellensatz. Established in 1996 by Alon et al. [4] and generalized in 1999 by Alon [2], the Combinatorial Nullstellensatz is a powerful tool that allows the use of polynomials to solve problems in number theory and graph theory. This article introduces the Combinatorial Nullstellensat...
متن کاملInfeasibility Certificates for linear matrix inequalities
Farkas’ lemma is a fundamental result from linear programming providing linear certificates for infeasibility of systems of linear inequalities. In semidefinite programming, such linear certificates only exist for strongly infeasible linear matrix inequalities. We provide nonlinear algebraic certificates for all infeasible linear matrix inequalities in the spirit of real algebraic geometry. Mor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2011
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2011.08.007